Counting Fixed-Length Permutation Patterns

نویسنده

Cheyne Homberger

چکیده

We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we obtain exact values for the expectation and variance for the number of large patterns in a random permutation. Finally, we are able to generalize the idea of bonds to obtain results on fixed-length patterns of any size, and present a construction that maximizes the number of patterns of a fixed size.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Algorithms for Finding Pattern Avoiders and Counting Pattern Occurrences in Permutations

Given a set Π of permutation patterns of length at most k, we present an algorithm for building S≤n(Π), the set of permutations of length at most n avoiding the patterns in Π, in time O(|S≤n−1(Π)| ·k+ |Sn(Π)|). Additionally, we present an O(n!k)-time algorithm for counting the number of copies of patterns from Π in each permutation in Sn. Surprisingly, when |Π| = 1, this runtime can be improved...

متن کامل

Pattern Avoidance in Permutations: Linear and Cyclic Orders

We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the first one corresponding to classical permutation avoidance. The cyclic modification allows for circular shifts in the entries. Using two bijections, both ascribable to both Deutsch and Krattenthaler independently, we sin...

متن کامل

Pattern and position based permutation statistics

Falling permutation patterns of length two where we allow to mark adjacency both in position and value give rise to three statistics, namely the adjacency (πi − πi+1 = 1), the descent and the inversion. The two former are equidistributed with the position based statistics fixed points and excedances, and the latter is Mahonian and thus equidistributed with many statistics. We prove that the bis...

متن کامل

Subsequence Containment by Involutions

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...

متن کامل